package example3;

import common.TreeNode;

//226.翻转二叉树
public class LeetCode226 {
    public static void main(String[] args) {

    }
}

class Solution226 {
    public TreeNode invertTree(TreeNode root) {
        if(root == null)    return null;
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }
}
